Optimal holey packing OHP4(2, 4, v, 2) for v≡2 (mod 3)
نویسنده
چکیده
Maximum distance holey packing MDHP(2, k, v, g) was first introduced by Yin and used to construct an optimal (g+1)-ary constant weight code (v, k, 2k−3) CWC. In this paper, an optimal holey packingOHPd(2, k,v, g) is introduced to construct an optimal (g + 1)-ary constant weight code (v, k, d) CWC. For k = 4, d = 4 and g = 2, it is proved that there exists an OHPd(2, k, v, g) for any integer v ≡ 2 (mod 3) and v ≥ 5.
منابع مشابه
Existence of Generalized Steiner Systems GS(2, 4, v, 2)
Generalized Steiner systems GS(2, 4, v, 2) were first discussed by Etzion and used to construct optimal constant weight codes over an alphabet of size three with minimum Hamming distance five, in which each codeword has length v and weight four. Etzion conjectured its existence for any integer v ≥ 7 and v ≡ 1 (mod 3). The conjecture has been verified for prime powers v > 7 and v ≡ 7 (mod 12) by...
متن کاملOn Kirkman packing designs KPD({3, 4}, v)
A Kirkman packing design KPD({3; 4∗∗}; v), is a resolvable packing of a v-set by the maximum possible number of parallel classes, each containing two blocks of size 4 and all other blocks of size three. Such designs can be used to construct certain threshold schemes. In this paper, direct and recursive constructions are discussed for such designs. The existence of a KPD({3; 4∗∗}; v) is establis...
متن کاملCombinatorial Constructions for Optical Orthogonal Codes
A (v, k, λ) optical orthogonal code C is a family of (0, 1) sequences of length v and weight k satisfying the following correlation properties: (1) ∑ 0≤t≤v−1xtxt+i ≤ λ for any x = (x0, x1, . . . , xv−1) ∈ C and any integer i ̸≡ 0 (mod v); (2) ∑ 0≤t≤v−1xtyt+i ≤ λ for any x = (x0, x1, . . . , xv−1) ∈ C, y = (y0, y1, . . . , yv−1) ∈ C with x ̸= y, and any integer i, where the subscripts are taken mo...
متن کاملOn packing designs with block size 5 and indices 3 and 5
Let V be a finite set of order v. A (V,K,A) packing design of index A and block size IC is a collection of K-element subsets, called blocks, such that every 2-subset of V occurs in at most A blocks. The packing problem is to determine the maximum number of blocks, D(V,K,A), in a packing design. It is well known that D(V,K,A) S [-i [:=~ ~]] : : t(VIK,~), where [xl is the largest integer satisfyi...
متن کاملBipacking pairs by quintuples: The case nu=13 (mod 20)
A (v, K, A) packing design of order v, block size K, and index 1 is a collection of K-element subsets, called blocks, of a v-set V such that every 2-subset of V occurs in at most L blocks. The packing problem is to determine the maximum number of blocks in a packing design. Packing with 1= 2 is called bipacking. In this paper we solve the bipacking problem in the case K = 5 and v = 13 (mod 20).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 27 شماره
صفحات -
تاریخ انتشار 2003